Designing Asymptotically Random GFSR Sequences
نویسندگان
چکیده
Tootill et al. proposed the concept of an asymptotically random Tausworthe sequence, and gave an example of such sequence found by chance. However, no systematic way of nding such sequences has been proposed by now. In this paper we will give an algorithm for designing GFSR sequences which satisfy the asymptotic randomness approximately. Our algorithm is based on repeated applications of the algorithm proposed by Fushimi. The sequence designed by the present algorithm have an added merit that their decimated sequences are also approximately asymptotically random. Some numerical examples will be shown.
منابع مشابه
An Implementation of a 5-term GFSR Random Number Generator for Parallel Computations
This paper describes an implementation of a 5-term GFSR (Generalized Feedback Shift Register) random number generator that generates mutually uncorrelated random number sequences on computing nodes of networked personal computers (PCs). As GFSR generators have extremely long periods and their autocorrelation functions are known, it is possible for the generator on each computing node to generat...
متن کاملMaximally Equidistributed Decimated GFSR Generators
This paper presents generators based on decimated sequences of Generalized Feedback Shift Register (GFSR) generators. The equivalence relation between decimated GFSR generators and Tausworthe generators are presented and a k-distributed initialization scheme is derived. We present decimated GFSR generators that are maximally equidistributed. Timing results of these generators are presented.
متن کاملA Unified View of Long-period Random Number Generators
Two types of linear congruent.ial random number generator are considered: the conventional one using integer arithmetic and another using polynomial arithmetic over finite fields. We show t.hat most of the long-period random number generators currently used or recently proposed, which include multiple re.:ursive generators, shift register generators, add-with-carry and subtract-with-borrow gene...
متن کاملStability and convergence theorems of pointwise asymptotically nonexpansive random operator in Banach space
In this paper, we prove the existence of a random fixed point of by using pointwise asymptotically nonexpansive random operator and the stability resultsof two iterative schemes for random operator.
متن کاملConvergence and Stability of Modified Random SP-Iteration for A Generalized Asymptotically Quasi-Nonexpansive Mappings
The purpose of this paper is to study the convergence and the almost sure T-stability of the modied SP-type random iterative algorithm in a separable Banach spaces. The Bochner in-tegrability of andom xed points of this kind of random operators, the convergence and the almost sure T-stability for this kind of generalized asymptotically quasi-nonexpansive random mappings are obtained. Our result...
متن کامل